Coded Computing and Cooperative Transmission for Wireless Distributed Matrix Multiplication
نویسندگان
چکیده
Consider a multi-cell mobile edge computing network, in which each user wishes to compute the product of user-generated data matrix with network-stored matrix. This is done through task offloading by means input uploading, distributed at nodes (ENs), and output downloading. Task may suffer long delay since servers some ENs be straggling due random computation time, wireless channels experience severe fading interference. paper aims investigate interplay among upload, computation, download latencies during process high signal-to-noise ratio regime from an information-theoretic perspective. A policy based on cascaded coded coordinated cooperative interference management uplink downlink proposed proved approximately optimal for sufficiently large upload time. By investing more time transmission, creates redundancy ENs, can reduce enabling use computing, as well via transmitter cooperation. Moreover, allows traded Numerical examples demonstrate that improve over existing schemes significantly reducing end-to-end execution
منابع مشابه
Coded Sparse Matrix Multiplication
In a large-scale and distributed matrix multiplication problem C = AB, where C ∈ Rr×t, the coded computation plays an important role to effectively deal with “stragglers” (distributed computations that may get delayed due to few slow or faulty processors). However, existing coded schemes could destroy the significant sparsity that exists in large-scale machine learning problems, and could resul...
متن کاملDistributed and Cooperative Compressive Sensing Recovery Algorithm for Wireless Sensor Networks with Bi-directional Incremental Topology
Recently, the problem of compressive sensing (CS) has attracted lots of attention in the area of signal processing. So, much of the research in this field is being carried out in this issue. One of the applications where CS could be used is wireless sensor networks (WSNs). The structure of WSNs consists of many low power wireless sensors. This requires that any improved algorithm for this appli...
متن کاملCoded Computing for Distributed Graph Analytics
Many distributed graph computing systems have been developed recently for efficient processing of massive graphs. These systems require many messages to be exchanged among computing machines at each step of the computation, making communication bandwidth a major performance bottleneck. We present a coded computing framework that systematically injects redundancy in the computation phase to enab...
متن کاملDistributed space-time coded protocols for exploiting cooperative diversity in wireless networks
We develop and analyze space–time coded cooperative diversity protocols for combating multipath fading across multiple protocol layers in a wireless network. The protocols exploit spatial diversity available among a collection of distributed terminals that relay messages for one another in such a manner that the destination terminal can average the fading, even though it is unknown a priori whi...
متن کاملComplexity Reduction by Using Triangular Matrix Multiplication in Computing Capacity for an Optimal Transmission
Multiple-input-multiple-output (MIMO) technique is often employed to increase capacity in comparing to systems with single antenna. However, the computational complexity in evaluating channel capacity or transmission rate (data rate) grows proportionally to the number of employed antennas at both ends of the wireless link. Recently, the QR decomposition (QRD) based detection schemes have emerge...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: IEEE Transactions on Communications
سال: 2021
ISSN: ['1558-0857', '0090-6778']
DOI: https://doi.org/10.1109/tcomm.2021.3053018